Efficient Card-Based Majority Voting Protocols

Abstract Card-based cryptography is a variety of secure multiparty computation (MPC). Recently, new technique called private operations was introduced because the protocol can be implemented with fewer cards than that by using conventional shuffle. For example, Nakai et al. showed if are available, computations AND and OR for two inputs realized simultaneously four cards, applied to four-card majority voting three inputs. This paper shows only sufficient construct Specifically, we propose constructions three-input protocols. One assuming players announce their output, other not allowed. Compared al.’s protocol, announcement without any additional communications. On hand, second construction requires more communications it removes assumption on from first construction. More importantly, idea extended an n -input which main result this paper.